package com.wc.AlgoOJ_train.train1.c8.A806;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/1/11 21:30
 * @description 光头强的棋盘
 * http://43.138.190.70:8888/p/A806
 */
public class Main {
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    public static void main(String[] args) {

        int idx = 1;
        int maxN = 35;
        long[][] dp = new long[maxN + 7][maxN + 7];
//        Arrays.fill(dp[0], 1);
        for (int i = 0; i <= maxN; i++) {
            dp[i][0] = 1;
        }
        // 上下三角的路都一样
        for (int i = 1; i <= 35; i++) {
            for (int j = 1; j <= i; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        while (true) {
            int n = sc.nextInt();
            if (n == -1) {
                break;
            }
            out.println(idx + " " + n + " " + dp[n][n] * 2);
            idx++;
        }
        out.flush();
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }
}


